Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings

We present optimal deterministic algorithms for constructing shallow cuttings in an arrangement of lines in two dimensions or planes in three dimensions. Our results improve the deterministic polynomial-time algorithm of Matoušek (1992) and the optimal but randomized algorithm of Ramos (1999). This leads to efficient derandomization of previous algorithms for numerous wellstudied problems in co...

متن کامل

Optimal 3-D Guidance from a 2-D Vision Sensor

This paper describes an optimal guidance policy for a vehicle to reach a relative position to a target, using information from a single fixed camera. Applying an extended Kalman filtering method, both of a velocity and a position of the vehicle relative to the target, can be estimated. However, estimates of a distance between the vehicle and the target are much worse than those of the other sta...

متن کامل

Submitted to Pattern Recognition New Algorithms for 2 D and 3 D Point Matching : Pose Estimation

A fundamental open problem in computer vision|determining pose and correspondence between two sets of points in space|is solved with a novel, fast O(nm)], robust and easily implementable algorithm. The technique works on noisy 2D or 3D point sets that may be of unequal sizes and may diier by non-rigid transformations. Using a combination of optimization techniques such as deterministic annealin...

متن کامل

Optimal projection of 2-D displacements for 3-D translational motion estimation

Recovering 3-D motion parameters from 2-D displacements is a difficult task, given the influence of noise contained in these data, which correspond at best to a crude approximation of the real motion field. Stability for the system of equations to solve is therefore essential. In this paper, we present a novel method based on an unbiased estimator that aims at enhancing this stability and stron...

متن کامل

Algorithms for 3 D Map Segment Registration

Many applications require dimensionally accurate and detailed maps of the environment. Mobile mapping devices with laser ranging devices can generate highly detailed and dimensionally accurate coordinate data in the form of point clouds. Point clouds represent scenes with numerous discrete coordinate samples obtained about a relative reference frame defined by the location and orientation of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2016

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-016-9784-4